The Lane hash function
نویسندگان
چکیده
Tischhauser for many interesting discussions concerning the design of Lane and its predecessors, and for their continued effort on the cryptanalysis of both older and the final version of Lane. Their findings, comments and suggestions for improvements were invaluable in the design process. I extend my gratitude to Antoon Bosselaers, Emilia Käsper, Miroslav Kneževi´c, Nicky Mouha and Vesselin Velichkov for their work on several implementations of Lane, and for giving useful feedback from the implementor's point of view. Additional thanks go to all of the people mentioned above, for their contributions to the writing and proofreading of this document. Finally, thanks to everyone in the COSIC research group for their support.
منابع مشابه
An Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملThe Lane hash function. Extended Abstract
In this document, we propose the cryptographic hash function Lane as a candidate for the SHA-3 competition [11] organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher [3,9] are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation. We give the specification of Lane, and the...
متن کاملCoding Theory and Hash Function Design - A Case Study: The Lane Hash Function
We illustrate how coding theory was applied in the design of the cryptographic hash function LANE [8]. The generic structure of the LANE compression function could potentially be vulnerable to a class of meet-in-the-middle attacks. While difficult to avoid at first sight, restating the problem in the domain of error correcting codes naturally leads to a simple and elegant solution. This ensures...
متن کاملRebound Attack on the Full Lane Compression Function
In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated...
متن کاملFPGA Implementations of SHA-3 Candidates: CubeHash, Grøstl, LANE, Shabal and Spectral Hash
Hash functions are widely used in, and form an important part of many cryptographic protocols. Currently, a public competition is underway to find a new hash algorithm(s) for inclusion in the NIST Secure Hash Standard (SHA-3). Computational efficiency of the algorithms in hardware will form one of the evaluation criteria. In this paper, we focus on five of these candidate algorithms, namely Cub...
متن کامل